A complexity theory of efficient parallel algorithms
نویسندگان
چکیده
منابع مشابه
Complexity theory - exploring the limits of efficient algorithms
Reading is a hobby to open the knowledge windows. Besides, it can provide the inspiration and spirit to face this life. By this way, concomitant with the technology development, many companies serve the e-book or book in soft file. The system of this book of course will be much easier. No worry to forget bringing the complexity theory exploring the limits of efficient algorithms book. You can o...
متن کاملGeometric Complexity Theory V: Efficient algorithms for Noether Normalization
We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether’s Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized polynomial-time Monte Carlo algorithm for this problem. For some interesting cases of explicit varieties, we give deterministic quasi-polynomial time algorith...
متن کاملParallel Real-Time Complexity Theory
We present a new complexity theoretic approach to real-time computations. We define timed ω-languages as a new formal model for such computations, that we believe to allow a unified treatment of all variants of real-time computations that are meaningful in practice. To our knowledge, such a practically meaningful formal definition does not exist at this time. In order to support our claim that ...
متن کاملComputational complexity of sequential and parallel algorithms
Downloading the book in this website lists can give you more advantages. It will show you the best book collections and completed collections. So many books can be found in this website. So, this is not only this computational complexity of sequential and parallel algorithms. However, this book is referred to read because it is an inspiring book to give you more chance to get experiences and al...
متن کاملRandomized Algorithms and Complexity Theory
In this paper we give an introduction to the connection between complexity theory and the study of randomized algorithms. In particular, we will define and study probabilistic complexity classes, survey the basic results, and show how they relate to the notion of randomized algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90192-k